A GRASP for the biquadratic assignment problem

The biquadratic assignment problem BiQAP is a generalization of the quadratic assignment problem QAP It is a nonlinear integer program ming problem where the objective function is a fourth degree multivariable polynomial and the feasible domain is the assignment polytope BiQAP problems appear in VLSI synthesis Due to the di culty of this problem only heuristic solution approaches have been proposed In this paper we propose a new heuristic for the BiQAP a greedy randomized adaptive search procedure GRASP Computational results on instances described in the literature indicate that this procedure consistently nds better so lutions than previously described algorithms